COMMENT ⊗   VALID 00007 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Directory of the Timing area
C00005 00003	Progress with InterLisp
C00006 00004	How to run things:
C00008 00005	Progress
C00009 00006	Metering progress
C00011 00007	Chart making programs
C00013 ENDMK
C⊗;
Directory of the Timing area

Benchmark Source	Announce	Timings		Discussion

↓SCCPP	  SCCP.MCL	SCCPP.BCH	SCCPP.TIM	

*TAK'	  TAK.MCL	TAK.BCH		TAK.TIM		TAK.TIM
STAK	  STAK.LSP			STAK.TIM
CTAK	  CTAK.LSP			CTAK.TIM
*FRPOLY	  FRPOLY.MCL    FRPOLY.BCH	FRPOLY.TIM
*TAKL	  TAKL.LSP	TAKL.LSP	TAKL.TIM
*TAKR	  TAKR.LSP	TAKR.LSP	TAKR.TIM
	  TAKR.BCH
PUZZLE	  PUZZLE.LSP	PUZZLE.BCH	PUZZLE.TIM	PUZZLE.DSC
PUZZL1	  PUZZL1.LSP	           
*DERIV	  DERIV.MCL	DERIV.BCH	DERIV.TIM
*DDERIV	  DDERIV.MCL    DDERIV.BCH	DDERIV.TIM
FDDERIV	  FDDERIV.MCL	FDDERIV.BCH	FDDERIV.TIM
*FFT	  FFT.LSP	FFT.LSP		FFT.TIM
*BROWSE	  BROWSE.LSP			BROWSE.TIM
TRAVERS	  TRAVERS.LSP			TRAVSES.TIM
*DIV2	  DIV2.LSP			DIV2.TIM
*FPRINT	  FPRINT.LSP			FPRINT.TIM
*FREAD	  FREAD.LSP			FREAD.TIM
*TPRINT	  TPRINT.LSP			TPRINT.TIM
*DESTRU   DESTRU.LSP			DESTRU.TIM
*TRIANG	  TRIANG.LSP			TRIANG.TIM
*BOYER	  BOYER.LSP			BOYER.TIM

RESULT.SUM all results in a table.

* Means the *.IL, the InterLisp version, exists as well.
Note: Do FPRINT benchmark before the FREAD.

PUZZL1.LSP - PUZZLE .LSP but for 1-based arrays
CACHE.TIM - sample of timings done with low load and cache on Wrong TAKR
CACHE.T2  - sample of timings done with low load and cache on TAKR fixed
CACHE.NL - sample of timings done with no load and cache on Wrong TAKR
UNCACHE.TIM - sample of timings done with no load and cache off Wrong TAKR
CACHE.L4 - load around 4, Wrong TAKR
PUZ.LD - PUZZLE benchmark under varying load
F2.TIM - CACHE timings on the Foonly

*.dil is d-machine InterLisp.
*.il0 is InterLisp-10.
Progress with InterLisp

TAK
BROWSE
DESTRU
How to run things:

TAK: (TAK 18 12 6)
CTAK: (TAK 18 12 6)
cTAK: (TAK 18 12 6)
TAKL: (TAK 18L 12L 6L)
TAKR: (TAK0 18 12 6)
FRPOLY: Do this: (SETUP); time these (BENCH 2)(BENCH 5)(BENCH 10)(BENCH 15)
PUZZLE: (START)
DERIV: (RUN)
DDERIV: (RUN)
FDDERIV: (RUN)
FFT: Time this:
	(DO ((NTIMES 0 (1+ NTIMES)))
	    ((= NTIMES 10.))
	    (FFT 'RE 'IM)))
BROWSE: (BROWSE)
TRAVERSE: Time these:
       (PROG2 (SETQ ROOT (CREATE-STRUCTURE 100.)) ()))
       (DO ((I 50. (1- I)))
	   ((= I 0))
	   (TRAVERSE ROOT)
	   (TRAVERSE ROOT)
	   (TRAVERSE ROOT)
	   (TRAVERSE ROOT)
	   (TRAVERSE ROOT))) 
DIV2: Time these:
       (TEST1 L)
       (TEST2 L)
FPRINT: (FPRINT)
FPREAD: (FREAD)
TPRINT: Time this: (PRINT TEST-PATTERN)
DESTRUCTIVE: (DESTRUCTIVE 600 50)
TRIANG:	(GOGOGO 22.)
BOYER: Time these:
	(SETUP)
	(TEST)
Progress

Metering progress

#	name	source file	statistics

1	TAK' 	MET1.LSP	MET1.STA
2	TRAVERS MET2.LSP	MET2.STA
3	DESTRU  MET3.LSP	MET3.STA
4	TRIANG	MET4.LSP	MET4.STA
5	DERIV	MET5.LSP	MET5.STA
6	DDERIV	MET6.LSP	MET6.STA
7	FDDERIV	MET7.LSP	MET7.STA
8	TAKL	MET8.LSP	MET8.STA
9	TAKR	MET9.LSP	MET9.STA
10	PUZZLE	MET10.LSP	MET10.STA
11	BROWSE	MET11.LSP	MET11.STA
12	FFT	MET12.LSP	MET12.STA
13	DIV2	MET13.LSP	MET13.STA
14	SCCPP	MET14.LSP	MET14.STA
15	FRPOLY	MET15.LSP	MET15.STA
16	BOYER	MET16.LSP	MET16.STA
17	TPRINT	MET17.LSP	MET17.STA
18	FPRINT	MET18.LSP	MET18.STA
19	FREAD	MET19.LSP	MET19.STA
20	STAK	MET20.LSP	MET20.STA
21	CTAK	MET21.LSP	MET21.STA

METALL.STA has them all
Chart making programs

CHART.LSP makes up ascii charts, suitable for netmailing:
here's what you do:

(fasload chart fas)
(fasload data fas)

(report-real)
(do-chart '(sail d1 d2 d3 s3600))

TCHART.LSP makes up TEX charts. Here's what you do:

(fasload tchart fas)
(fasload data fas)

(do-tchart-real '(sail d1 d2 d3 s3600))

(do-tchart-cpu '(sail d1 d2 d3 s3600))

You can set *normalize* to normalize the chart (best in row is assignd 1.0
others scaled). You can set *global-normalize* to normalize over all implementations,
not just the ones supplied. *global-normalize* can be (), t, or the name
of a benchmark to which all global normalizations are done.

FCHART.LSP makes up a TEX chart of the raw data supplied by implementors.
Here's what you do:

(fasload fchart fas)
(fasload data fas)

(do-fchart 'tak)
(do-fchart 'traverse)  ;makes up 2 charts
(do-fchart 'traverse-init) ;makes up 1 chart

SCHART.LSP makes up a sorted chart of each implementation, best on top
and worst on the bottom, and if *normalize* is T, it is normalized.
Here's what you do:

(fasload fchart fas)
(fasload data fas)

(do-schart 'tak)
(do-schart 'traverse)  ;makes up 2 charts
(do-schart 'traverse-init) ;makes up 1 chart